The maximum edge biclique problem is NP-complete
نویسندگان
چکیده
منابع مشابه
The maximum edge biclique problem is NP-complete
We prove that the maximum edge biclique problem in bipartite graphs is NP-complete. A biclique in a bipartite graph is a vertex induced subgraph which is complete. The problem of finding a biclique with a maximum number of vertices is known to be solvable in polynomial time but the complexity of finding a biclique with a maximum number of edges was still undecided.
متن کاملNonnegative Factorization and The Maximum Edge Biclique Problem
Nonnegative Matrix Factorization (NMF) is a data analysis technique which allows compression and interpretation of nonnegative data. NMF became widely studied after the publication of the seminal paper by Lee and Seung (Learning the Parts of Objects by Nonnegative Matrix Factorization, Nature, 1999, vol. 401, pp. 788–791), which introduced an algorithm based on Multiplicative Updates (MU). More...
متن کاملA continuous characterization of the maximum-edge biclique problem
The problem of finding large complete subgraphs in bipartite graphs (that is, bicliques) is a well-known combinatorial optimization problem referred to as the maximum-edge biclique problem (MBP), and has many applications, e.g., in web community discovery, biological data analysis and text mining. In this paper, we present a new continuous characterization for MBP. Given a bipartite graphG, we ...
متن کاملMaximum Pagenumber-k Subgraph is NP-Complete
Given a graph G with a total order defined on its vertices, the Maximum Pagenumber-k Subgraph Problem asks for a maximum subgraph G′ of G such that G′ can be embedded into a k-book when the vertices are placed on the spine according to the specified total order. We show that this problem is NP-complete for k ≥ 2.
متن کاملMaximizing edge-ratio is NP-complete
Given a graph G and a bipartition of its vertices, the edge-ratio is the minimum for both classes so defined of their number of internal edges divided by their number of cut edges. We prove that maximizing edgeratio is NP-complete.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2003
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(03)00333-0